Improving the Thresholds of Generalized LDPC Codes With Convolutional Code Constraints
نویسندگان
چکیده
CC-GLPDC codes are a class of generalized low-density parity-check (GLDPC) where the constraint nodes (CNs) represent convolutional codes. This allows for efficient decoding in trellis with forward-backward algorithm, and strength component easily can be controlled by encoder memory without changing graph structure. In this letter, we extend CC-GLDPC introducing different types irregularity at CNs investigating their effect on BP MAP thresholds binary erasure channel (BEC). For considered codes, an exhaustive grid search is performed to find BP-optimized MAP-optimized ensembles compare regular ensemble same design rate. The results show that significantly improve thresholds, whereas only slightly from ensembles. Simulation AWGN presented as well compared corresponding thresholds.
منابع مشابه
Structured LDPC convolutional codes
LDPC convolutional codes, also known as spatially coupled LDPC codes, have attracted considerable attention due to their promising properties. By coupling the protographs from different positions into a chain and terminating the chain properly, the resulting convolutional-like LDPC code ensemble is able to produce capacityachieving performance in the limit of large parameters. In addition, opti...
متن کاملType-III LDPC Convolutional Codes
A class of geometrically structured quasi-cyclic low-density paritycheck codes with a cylinder structure graph and girth 12 is considered. The parity-check matrix of such a code consists of blocks of zeros and circulant permutation matrices. A class of convolutional codes is assigned to these codes. The convolutional form generator matrix of these codes is obtained by elementary row and column ...
متن کاملTerminated LDPC Convolutional Codes over GF(2)
In this paper, we present a construction method of terminated non-binary low-density parity-check (LDPC) convolutional codes. Our construction method is an expansion of Felstrom and Zigangirov construction [1] for non-binary LDPC convolutional codes. The rate-compatibility of the non-binary LDPC convolutional codes is also discussed. The proposed ratecompatible code is designed from one single ...
متن کاملDecoding LDPC Convolutional Codes on Markov Channels
This paper describes a pipelined iterative technique for joint decoding and channel state estimation of LDPC convolutional codes over Markov channels. Example designs are presented for the Gilbert-Elliott discrete channel model. We also compare the performance and complexity of our algorithm against joint decoding and state estimation of conventional LDPC block codes. Complexity analysis reveal...
متن کاملThreshold Saturation for LDPC Convolutional Code Ensembles
Low-density parity-check (LDPC) codes, originally invented by Gallager in 1963, are now well-known for their good performances. Their convolutional counterpart was introduced by Felström and Zigangirov in 1999 and have already been shown to be able to achieve the Shannon capacity under low-complexity iterative decoding algorithms. In principle, the belief-propagation (BP) threshold of the convo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2023
ISSN: ['1558-2558', '1089-7798', '2373-7891']
DOI: https://doi.org/10.1109/lcomm.2023.3274088